Lossy Kernels for Connected Dominating Set on Sparse Graphs
نویسندگان
چکیده
منابع مشابه
Lossy Kernels for Connected Dominating Set on Sparse Graphs
In standard kernelization algorithms, the usual goal is to reduce, in polynomial time, an instance (I, k) of a parameterized problem to an equivalent instance (I ′, k′) of size bounded by a function in k. One of the central problems in this area, whose investigation has led to the development of many kernelization techniques, is the Dominating Set problem. Given a graph G and k ∈ N, Dominating ...
متن کاملKernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs
We give the first linear kernels for the Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we prove the existence of polynomial time algorithms that, for a given H-topological-minor-free graph G and a positive integer k, output an H-topologicalminor-free graph G′ on O(k) vertices such that G has a (connected) dominat...
متن کاملLinear kernels for (connected) dominating set on graphs with excluded topological subgraphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we give polynomial time algorithms that, for a given H-topological-minor free graph G and a positive integer k, output an H-topological-minor free graph G′ on O(k) vertices such that G has a (connected) dominating set of size k if ...
متن کاملLinear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time algorithms that, for a given H-minor free graph G and positive integer k, output an H-minor free graph G′ on O(k) vertices such that G has a (connected) dominating set of size k if and only if G′ has. Prior to our work,...
متن کاملOn minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2019
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1172508